Minimal acyclic dominating sets and cut-vertices
نویسندگان
چکیده
منابع مشابه
Enumeration of Minimal Dominating Sets and Variants
In this paper, we are interested in the enumeration of minimal dominating sets in graphs. A polynomial delay algorithm with polynomial space in split graphs is presented. We then introduce a notion of maximal extension (a set of edges added to the graph) that keeps invariant the set of minimal dominating sets, and show that graphs with extensions as split graphs are exactly the ones having chor...
متن کاملTrees having many minimal dominating sets
We disprove a conjecture by Skupień that every tree of order n has at most 2 minimal dominating sets. We construct a family of trees of both parities of the order for which the number of minimal dominating sets exceeds 1.4167. We also provide an algorithm for listing all minimal dominating sets of a tree in time O(1.4656). This implies that every tree has at most 1.4656 minimal dominating sets.
متن کاملMinimal 2-dominating sets in trees
We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.
متن کاملMinimal Double Dominating Sets in Trees
We provide an algorithm for listing all minimal double dominating sets of a tree of order n in time O(1.3248). This implies that every tree has at most 1.3248 minimal double dominating sets. We also show that this bound is tight.
متن کاملMinimal dominating sets in maximum domatic partitions
The domatic number d(G) of a graph G = (V,E) is the maximum order of a partition of V into dominating sets. Such a partition Π = {D1, D2, . . . , Dd} is called a minimal dominating d-partition if Π contains the maximum number of minimal dominating sets, where the maximum is taken over all d-partitions of G. The minimal dominating d-partition number Λ(G) is the number of minimal dominating sets ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Bohemica
سال: 2005
ISSN: 0862-7959,2464-7136
DOI: 10.21136/mb.2005.134216